Processor Efficient Parallel Solution
نویسنده
چکیده
Nous pr esentons un algorithme parall ele d eterministe pour la r esolution d'un syst eme d' equations lin eaires Ax = b sur un corps de caract eristique nulle. Cet algorithme s'ex ecute en temps O(log 2 n) et utilise O(M(n)) processeurs arithm etiques si M(n) est le nombre de processeurs requis pour le produit de matrices en temps O(log n). Abstract. We present a deterministic parallel algorithm that solves a n-dimensional system Ax = b of linear equations over a eld of characteristic zero. This algorithm uses O(log 2 n) parallel time and O(M(n)) arithmetic processors if M(n) is the processor complexity of parallel matrix multiplication.
منابع مشابه
A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملUltra-Low-Energy DSP Processor Design for Many-Core Parallel Applications
Background and Objectives: Digital signal processors are widely used in energy constrained applications in which battery lifetime is a critical concern. Accordingly, designing ultra-low-energy processors is a major concern. In this work and in the first step, we propose a sub-threshold DSP processor. Methods: As our baseline architecture, we use a modified version of an existing ultra-low-power...
متن کاملAn Efficient Parallel Algorithm for the All Pairs Shortest Path Problem
The all pairs shortest path problem is a class of the algebraic path problem. Many parallel algorithms for the solution of this problem appear in the literature. One of the efficient parallel algorithms on W-RAM model is given by Kucera[17]. Though efficient, algorithms written for the W-RAM model of parallel computation are too idealistic to be implemented on the current hardware. In this repo...
متن کاملProcessor Efficient Parallel Solution of Linear Systems of Equations
We present a deterministic parallel algorithm that solves a n-dimensional system Ax b of linear equations over an ordered field or over a subfield of the complex Ž 2 . Ž Ž . 2 numbers. This algorithm uses O log n parallel time and O max M n , n Ž . 4. Ž . log log n log n arithmetic processors if M n is the processor complexity of fast parallel matrix multiplication. 2000 Academic Press
متن کاملThe Method of the Chess Search Algorithms Parallelization Using Two-processor Distributed System
This paper is concerned with the realization of the parallel computer chess application. The asynchronous parallel search algorithm uses two processors connected via distributed local network. The original solution is implemented and tested in author’s chess application Axon. The standard approaches of parallelism use dual and quad server PC machine, which is expensive and rare compared with cl...
متن کامل